github.com/andybalholm/brotli.huffmanCode.bits (field)

20 uses

	github.com/andybalholm/brotli (current package)
		decode.go#L333: 	if table[0].bits > huffmanTableBits {
		decode.go#L334: 		var nbits uint32 = uint32(table[0].bits) - huffmanTableBits
		decode.go#L339: 	dropBits(br, uint32(table[0].bits))
		decode.go#L355: 		if table[0].bits == 0 {
		decode.go#L365: 	if table[0].bits <= huffmanTableBits {
		decode.go#L366: 		if uint32(table[0].bits) <= available_bits {
		decode.go#L367: 			dropBits(br, uint32(table[0].bits))
		decode.go#L380: 	val = (val & bitMask(uint32(table[0].bits))) >> huffmanTableBits
		decode.go#L384: 	if available_bits < uint32(table[0].bits) {
		decode.go#L388: 	dropBits(br, huffmanTableBits+uint32(table[0].bits))
		decode.go#L410: 	*bits = uint32(table[0].bits)
		decode.go#L425: 		dropBits(br, uint32(ext[0].bits))
		decode.go#L589: 		dropBits(br, uint32(p[0].bits)) /* Use 1..5 bits. */
		decode.go#L629: 		if uint32(p[0].bits) > available_bits {
		decode.go#L636: 			dropBits(br, uint32(p[0].bits))
		decode.go#L640: 			var repeat_delta uint32 = (bits >> p[0].bits) & bitMask(extra_bits)
		decode.go#L641: 			if available_bits < uint32(p[0].bits)+extra_bits {
		decode.go#L646: 			dropBits(br, uint32(p[0].bits)+extra_bits)
		huffman.go#L69: 	bits  byte
		huffman.go#L75: 	h.bits = bits